Extending the Path - Planning
نویسندگان
چکیده
The mobility sensors on a typical mobile robot vehicle have limited range. Therefore a navigation system has no knowledge about the world beyond this sensing horizon. As a result, path planners that rely only on this knowledge to compute paths are unable to anticipate obstacles sufficiently early and have no choice but to resort to an inefficient local obstacle avoidance behavior. To alleviate this problem, we present an opportunistic navigation and view planning strategy that incorporates look-ahead sensing of possible obstacle configurations. This planning strategy is based on a “what-if” analysis of hypothetical future configurations of the environment. Candidate sensing positions are evaluated based on their ability to observe anticipated obstacles. These sensing positions identified by this forward-simulation framework are used by the planner as intermediate waypoints. The validity of the strategy is supported by results from simulations as well as field experiments with a real robotic platform. These results show that significant reduction in path length can be achieved by using this framework. KEY WORDS—autonomous vehicles, path planning, perception, forward simulation, inference
منابع مشابه
Life Extending Minimum-Time Path Planning for Hexapod Robot
This paper presents a minimum‐time path planning scheme for life‐extending operation of legged robots, illustrated with a six‐legged walking robot (hexapod). The focus of this study is on extending the bearing fatigue life for leg joints. As a typical treatment, the minimum‐time path planning is performed through a bisecting‐plane (BP) algorithm with the co...
متن کاملRobotic Path Planning using Rapidly exploring Random Trees
Rapidly exploring Random Tree (RRT) path planning methods provide feasible paths between a start and goal point in configuration spaces containing obstacles, sacrificing optimality (eg. Shortest path) for speed. The raw resultant paths are generally jagged and the cost of extending the tree can increase steeply as the number of existing branches grow. This paper provides details of a speed-up m...
متن کاملParallel Planning in Partitioned Problem Spaces
This paper presents a complete and optimal framework for extending basic graph planning to operate in partitioned problem spaces. These spaces typically occur in systems that implement a hierarchy or contain data of various resolutions. An algorithm for the framework will be presented along with a proof of optimality. Finally, an example implementation for mobile robot path planning will be dis...
متن کاملPoint-to-point and multi-goal path planning for industrial robots
This article presents contributions in the field of path planning for industrial robots with 6 degrees of freedom. This work presents the results of our research in the last 4 years at the Institute for Process Control and Robotics at the University of Karlsruhe. The path planning approach we present works in an implicit and discretized C-space. Collisions are detected in the Cartesian workspac...
متن کاملStudy of Evolutionary and Swarm Intelligent Techniques for Soccer Robot Path Planning
Finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. Due to simplicity and smoothness of Ferguson Spline, it has been employed for path planning between arbitrary points on the field in many research teams. In order to optimize the parameters of Ferguson Spline some evolutionary or intelligent al...
متن کاملPSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety
In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...
متن کامل